Refined node polynomials via long edge graphs

Some results on vertex-edge Wiener polynomials and indices of graphs

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

Visualizing Graphs with Node and Edge Labels

When drawing graphs whose edges and nodes contain text or graphics, such information needs to be displayed without overlaps, either as part of the initial layout or as a post-processing step. The core problem in removing overlaps lies in retaining the structural information inherent in a layout, minimizing the additional area required, and keeping edges as straight as possible. This paper prese...

On edge detour index polynomials

The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC4C8(S)$ nanotorus.

Tutte Polynomials of Flower Graphs

Clustering graphs for visualization via node similarities

Graph visualization is commonly used to visually model relations in many areas. Examples include Web sites, CASE tools, and knowledge representation. When the amount of information in these graphs becomes too large, users, however, cannot perceive all elements at the same time. A clustered graph can greatly reduce visual complexity by temporarily replacing a set of nodes in clusters with abstra...